Succinct Greedy Graph Drawing in R
نویسندگان
چکیده
In greedy geometric routing, messages are passed in a network embedded in a metric space according to the greedy strategy of always forwarding messages to nodes that are closer to the destination. We show that greedy graph drawing schemes exist for the Euclidean metric in R, for 3-connected planar graphs, with coordinates that can be represented succinctly, that is, with O(log n) bits. Moreover, our embedding strategy introduces a coordinate system for R that supports distance comparisons using our succinct coordinates. Thus, our scheme can be used to significantly reduce bandwidth, space, and header size over other recently discovered greedy geometric routing implementations for R.
منابع مشابه
Succinct Greedy Graph Drawing in the Hyperbolic Plane
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so that a message M between any pair of vertices may be routed geometrically, simply by having each vertex that receives M pass it along to any neighbor that is closer in the hyperbolic metric to the message’s eventual d...
متن کاملEuclidean Greedy Drawings of Trees
Greedy embedding (or drawing) is a simple and efficient strategy to route messages in wireless sensor networks. For each sourcedestination pair of nodes s, t in a greedy embedding there is always a neighbor u of s that is closer to t according to some distance metric. The existence of Euclidean greedy embeddings in R is known for certain graph classes such as 3-connected planar graphs. We compl...
متن کاملSuccinct Greedy Geometric Routing in R
In greedy geometric routing, messages are passed in a network embedded in a metric space according to the greedy strategy of always forwarding messages to nodes that are closer to the destination. In this paper, we study greedy geometric routing in R, using the standard Euclidean metric. Greedy geometric routing is not always possible in fixed-dimensional Euclidean spaces, of course, as is the ...
متن کاملSuccinct Greedy Geometric Routing in the Euclidean Plane
We show that greedy geometric routing schemes exist for the Euclidean metric in R, for 3-connected planar graphs, with coordinates that can be represented succinctly, that is, with O(log n) bits, where n is the number of vertices in the graph.
متن کاملSuccinct Greedy Drawings May Be Unfeasible
A greedy drawing is a straight-line drawing that contains a distance-decreasing path for every pair of nodes. A path (v0, v1, . . . , vm) is distance-decreasing if d(vi, vm) < d(vi−1, vm), for i = 1, . . . ,m. Greedy drawings easily support geographic greedy routing. Hence, a natural and practical problem is the one of constructing greedy drawings in the plane, using few bits for representing v...
متن کامل